TSTP Solution File: ITP140^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP140^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:06 EDT 2024
% Result : Theorem 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 25 ( 11 unt; 9 typ; 0 def)
% Number of atoms : 90 ( 55 equ; 0 cnn)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 297 ( 23 ~; 21 |; 11 &; 230 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 0 ^ 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
paraco1605129243lle_tv: $tType ).
thf(decl_sort2,type,
list_char: $tType ).
thf(decl_sort3,type,
paraco1604210848lle_fm: $tType ).
thf(decl_57,type,
paraco1325918602e_eval: ( list_char > paraco1605129243lle_tv ) > paraco1604210848lle_fm > paraco1605129243lle_tv ).
thf(decl_58,type,
paraco69239110le_Con: paraco1604210848lle_fm > paraco1604210848lle_fm > paraco1604210848lle_fm ).
thf(decl_64,type,
paraco1344940915le_Det: $o > paraco1605129243lle_tv ).
thf(decl_183,type,
i: list_char > paraco1605129243lle_tv ).
thf(decl_184,type,
p1: paraco1604210848lle_fm ).
thf(decl_185,type,
p2: paraco1604210848lle_fm ).
thf(fact_5_eval_Osimps_I4_J,axiom,
! [X5: list_char > paraco1605129243lle_tv,X6: paraco1604210848lle_fm,X7: paraco1604210848lle_fm] :
( ( ( ( paraco1325918602e_eval @ X5 @ X6 )
= ( paraco1325918602e_eval @ X5 @ X7 ) )
=> ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1325918602e_eval @ X5 @ X6 ) ) )
& ( ( ( paraco1325918602e_eval @ X5 @ X6 )
!= ( paraco1325918602e_eval @ X5 @ X7 ) )
=> ( ( ( ( paraco1325918602e_eval @ X5 @ X6 )
= ( paraco1344940915le_Det @ $true ) )
=> ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1325918602e_eval @ X5 @ X7 ) ) )
& ( ( ( paraco1325918602e_eval @ X5 @ X6 )
!= ( paraco1344940915le_Det @ $true ) )
=> ( ( ( ( paraco1325918602e_eval @ X5 @ X7 )
= ( paraco1344940915le_Det @ $true ) )
=> ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1325918602e_eval @ X5 @ X6 ) ) )
& ( ( ( paraco1325918602e_eval @ X5 @ X7 )
!= ( paraco1344940915le_Det @ $true ) )
=> ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1344940915le_Det @ ~ $true ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ISeZU97zVD/E---3.1_6938.p',fact_5_eval_Osimps_I4_J) ).
thf(conj_0,conjecture,
( ( paraco1325918602e_eval @ i @ ( paraco69239110le_Con @ p1 @ p2 ) )
= ( paraco1325918602e_eval @ i @ p1 ) ),
file('/export/starexec/sandbox/tmp/tmp.ISeZU97zVD/E---3.1_6938.p',conj_0) ).
thf(fact_0_a_H_H,axiom,
( ( paraco1325918602e_eval @ i @ p1 )
!= ( paraco1344940915le_Det @ $true ) ),
file('/export/starexec/sandbox/tmp/tmp.ISeZU97zVD/E---3.1_6938.p',fact_0_a_H_H) ).
thf(fact_1_a,axiom,
( ( paraco1325918602e_eval @ i @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
file('/export/starexec/sandbox/tmp/tmp.ISeZU97zVD/E---3.1_6938.p',fact_1_a) ).
thf(c_0_4,plain,
! [X5: list_char > paraco1605129243lle_tv,X6: paraco1604210848lle_fm,X7: paraco1604210848lle_fm] :
( ( ( ( paraco1325918602e_eval @ X5 @ X6 )
= ( paraco1325918602e_eval @ X5 @ X7 ) )
=> ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1325918602e_eval @ X5 @ X6 ) ) )
& ( ( ( paraco1325918602e_eval @ X5 @ X6 )
!= ( paraco1325918602e_eval @ X5 @ X7 ) )
=> ( ( ( ( paraco1325918602e_eval @ X5 @ X6 )
= ( paraco1344940915le_Det @ $true ) )
=> ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1325918602e_eval @ X5 @ X7 ) ) )
& ( ( ( paraco1325918602e_eval @ X5 @ X6 )
!= ( paraco1344940915le_Det @ $true ) )
=> ( ( ( ( paraco1325918602e_eval @ X5 @ X7 )
= ( paraco1344940915le_Det @ $true ) )
=> ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1325918602e_eval @ X5 @ X6 ) ) )
& ( ( ( paraco1325918602e_eval @ X5 @ X7 )
!= ( paraco1344940915le_Det @ $true ) )
=> ( ( ~ ~ $true
| ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1344940915le_Det @ $true ) ) )
& ( ~ $true
| ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X6 @ X7 ) )
= ( paraco1344940915le_Det @ $false ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[fact_5_eval_Osimps_I4_J])]) ).
thf(c_0_5,negated_conjecture,
( ( paraco1325918602e_eval @ i @ ( paraco69239110le_Con @ p1 @ p2 ) )
!= ( paraco1325918602e_eval @ i @ p1 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_6,plain,
! [X1057: list_char > paraco1605129243lle_tv,X1058: paraco1604210848lle_fm,X1059: paraco1604210848lle_fm] :
( ( ( ( paraco1325918602e_eval @ X1057 @ X1058 )
!= ( paraco1325918602e_eval @ X1057 @ X1059 ) )
| ( ( paraco1325918602e_eval @ X1057 @ ( paraco69239110le_Con @ X1058 @ X1059 ) )
= ( paraco1325918602e_eval @ X1057 @ X1058 ) ) )
& ( ( ( paraco1325918602e_eval @ X1057 @ X1058 )
!= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ ( paraco69239110le_Con @ X1058 @ X1059 ) )
= ( paraco1325918602e_eval @ X1057 @ X1059 ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1058 )
= ( paraco1325918602e_eval @ X1057 @ X1059 ) ) )
& ( ( ( paraco1325918602e_eval @ X1057 @ X1059 )
!= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ ( paraco69239110le_Con @ X1058 @ X1059 ) )
= ( paraco1325918602e_eval @ X1057 @ X1058 ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1058 )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1058 )
= ( paraco1325918602e_eval @ X1057 @ X1059 ) ) )
& ( $true
| ( ( paraco1325918602e_eval @ X1057 @ ( paraco69239110le_Con @ X1058 @ X1059 ) )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1059 )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1058 )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1058 )
= ( paraco1325918602e_eval @ X1057 @ X1059 ) ) )
& ( ~ $true
| ( ( paraco1325918602e_eval @ X1057 @ ( paraco69239110le_Con @ X1058 @ X1059 ) )
= ( paraco1344940915le_Det @ $false ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1059 )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1058 )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X1057 @ X1058 )
= ( paraco1325918602e_eval @ X1057 @ X1059 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,plain,
( ( paraco1325918602e_eval @ i @ p1 )
!= ( paraco1344940915le_Det @ $true ) ),
inference(fof_simplification,[status(thm)],[fact_0_a_H_H]) ).
thf(c_0_8,negated_conjecture,
( ( paraco1325918602e_eval @ i @ ( paraco69239110le_Con @ p1 @ p2 ) )
!= ( paraco1325918602e_eval @ i @ p1 ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X5: list_char > paraco1605129243lle_tv,X2: paraco1604210848lle_fm,X1: paraco1604210848lle_fm] :
( ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X2 @ X1 ) )
= ( paraco1325918602e_eval @ X5 @ X2 ) )
| ( ( paraco1325918602e_eval @ X5 @ X2 )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X5 @ X2 )
= ( paraco1325918602e_eval @ X5 @ X1 ) )
| ( ( paraco1325918602e_eval @ X5 @ X1 )
!= ( paraco1344940915le_Det @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( paraco1325918602e_eval @ i @ p1 )
!= ( paraco1344940915le_Det @ $true ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( paraco1325918602e_eval @ i @ ( paraco69239110le_Con @ p1 @ p2 ) )
!= ( paraco1325918602e_eval @ i @ p1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X1: paraco1604210848lle_fm,X5: list_char > paraco1605129243lle_tv,X2: paraco1604210848lle_fm] :
( ( ( paraco1325918602e_eval @ X5 @ ( paraco69239110le_Con @ X1 @ X2 ) )
= ( paraco1325918602e_eval @ X5 @ X1 ) )
| ( ( paraco1325918602e_eval @ X5 @ X1 )
= ( paraco1344940915le_Det @ $true ) )
| ( ( paraco1325918602e_eval @ X5 @ X2 )
!= ( paraco1344940915le_Det @ $true ) ) ),
inference(local_rw,[status(thm)],[inference(cn,[status(thm)],[c_0_9])]) ).
thf(c_0_13,plain,
( ( paraco1325918602e_eval @ i @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
inference(split_conjunct,[status(thm)],[fact_1_a]) ).
thf(c_0_14,plain,
( ( paraco1325918602e_eval @ i @ p1 )
!= ( paraco1344940915le_Det @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ITP140^1 : TPTP v8.1.2. Released v7.5.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n032.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 12:30:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.50 Running higher-order theorem proving
% 0.19/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ISeZU97zVD/E---3.1_6938.p
% 0.19/0.56 # Version: 3.1.0-ho
% 0.19/0.56 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.56 # Starting full_lambda_7 with 300s (1) cores
% 0.19/0.56 # Starting new_ho_4 with 300s (1) cores
% 0.19/0.56 # Starting lpo5_fix with 300s (1) cores
% 0.19/0.56 # new_ho_4 with pid 7018 completed with status 0
% 0.19/0.56 # Result found by new_ho_4
% 0.19/0.56 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.56 # Starting full_lambda_7 with 300s (1) cores
% 0.19/0.56 # Starting new_ho_4 with 300s (1) cores
% 0.19/0.56 # SinE strategy is GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true)
% 0.19/0.56 # Search class: HGUSM-FSLS31-MHSFFMBN
% 0.19/0.56 # partial match(2): HGUSM-FSLM31-MHSFFSBN
% 0.19/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.56 # new_ho_10 with pid 7020 completed with status 0
% 0.19/0.56 # Result found by new_ho_10
% 0.19/0.56 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.56 # Starting full_lambda_7 with 300s (1) cores
% 0.19/0.56 # Starting new_ho_4 with 300s (1) cores
% 0.19/0.56 # SinE strategy is GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true)
% 0.19/0.56 # Search class: HGUSM-FSLS31-MHSFFMBN
% 0.19/0.56 # partial match(2): HGUSM-FSLM31-MHSFFSBN
% 0.19/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.56 # Preprocessing time : 0.005 s
% 0.19/0.56 # Presaturation interreduction done
% 0.19/0.56
% 0.19/0.56 # Proof found!
% 0.19/0.56 # SZS status Theorem
% 0.19/0.56 # SZS output start CNFRefutation
% See solution above
% 0.19/0.56 # Parsed axioms : 558
% 0.19/0.56 # Removed by relevancy pruning/SinE : 475
% 0.19/0.56 # Initial clauses : 262
% 0.19/0.56 # Removed in clause preprocessing : 37
% 0.19/0.56 # Initial clauses in saturation : 225
% 0.19/0.56 # Processed clauses : 341
% 0.19/0.56 # ...of these trivial : 9
% 0.19/0.56 # ...subsumed : 18
% 0.19/0.56 # ...remaining for further processing : 314
% 0.19/0.56 # Other redundant clauses eliminated : 48
% 0.19/0.56 # Clauses deleted for lack of memory : 0
% 0.19/0.56 # Backward-subsumed : 0
% 0.19/0.56 # Backward-rewritten : 10
% 0.19/0.56 # Generated clauses : 181
% 0.19/0.56 # ...of the previous two non-redundant : 95
% 0.19/0.56 # ...aggressively subsumed : 0
% 0.19/0.56 # Contextual simplify-reflections : 0
% 0.19/0.56 # Paramodulations : 100
% 0.19/0.56 # Factorizations : 0
% 0.19/0.56 # NegExts : 0
% 0.19/0.56 # Equation resolutions : 59
% 0.19/0.56 # Disequality decompositions : 0
% 0.19/0.56 # Total rewrite steps : 73
% 0.19/0.56 # ...of those cached : 51
% 0.19/0.56 # Propositional unsat checks : 0
% 0.19/0.56 # Propositional check models : 0
% 0.19/0.56 # Propositional check unsatisfiable : 0
% 0.19/0.56 # Propositional clauses : 0
% 0.19/0.56 # Propositional clauses after purity: 0
% 0.19/0.56 # Propositional unsat core size : 0
% 0.19/0.56 # Propositional preprocessing time : 0.000
% 0.19/0.56 # Propositional encoding time : 0.000
% 0.19/0.56 # Propositional solver time : 0.000
% 0.19/0.56 # Success case prop preproc time : 0.000
% 0.19/0.56 # Success case prop encoding time : 0.000
% 0.19/0.56 # Success case prop solver time : 0.000
% 0.19/0.56 # Current number of processed clauses : 87
% 0.19/0.56 # Positive orientable unit clauses : 29
% 0.19/0.56 # Positive unorientable unit clauses: 0
% 0.19/0.56 # Negative unit clauses : 20
% 0.19/0.56 # Non-unit-clauses : 38
% 0.19/0.56 # Current number of unprocessed clauses: 167
% 0.19/0.56 # ...number of literals in the above : 908
% 0.19/0.56 # Current number of archived formulas : 0
% 0.19/0.56 # Current number of archived clauses : 212
% 0.19/0.56 # Clause-clause subsumption calls (NU) : 6358
% 0.19/0.56 # Rec. Clause-clause subsumption calls : 280
% 0.19/0.56 # Non-unit clause-clause subsumptions : 9
% 0.19/0.56 # Unit Clause-clause subsumption calls : 244
% 0.19/0.56 # Rewrite failures with RHS unbound : 0
% 0.19/0.56 # BW rewrite match attempts : 16
% 0.19/0.56 # BW rewrite match successes : 9
% 0.19/0.56 # Condensation attempts : 341
% 0.19/0.56 # Condensation successes : 0
% 0.19/0.56 # Termbank termtop insertions : 29404
% 0.19/0.56 # Search garbage collected termcells : 7676
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.038 s
% 0.19/0.56 # System time : 0.006 s
% 0.19/0.56 # Total time : 0.044 s
% 0.19/0.56 # Maximum resident set size: 3888 pages
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.046 s
% 0.19/0.56 # System time : 0.010 s
% 0.19/0.56 # Total time : 0.056 s
% 0.19/0.56 # Maximum resident set size: 2908 pages
% 0.19/0.56 % E---3.1 exiting
% 0.19/0.57 % E exiting
%------------------------------------------------------------------------------